A comparison of four propositional theorem provers

نویسنده

  • Lars-Henrik Eriksson
چکیده

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Theorem Provers for Substructural Logics

We describe theorem provers for some decidable propositional sub-

متن کامل

Propositional Simplification With BDDs and SAT Solvers

We show how LCF-style interactive theorem provers might use BDD engines and SAT solvers to perform normalization, simplification of terms and theorems, and assist with interactive proof. The treatment builds on recent work integrating SAT solvers as non-trusted decision procedures for LCF-style theorem provers. We limit ourselves to propositional logic, but briefly note that the results may be ...

متن کامل

Result Certification of Static Program Analysers with Automated Theorem Provers

The automation of the deductive approach to program verification crucially depends on the ability to efficiently infer and discharge program invariants. In an ideal world, user-provided invariants would be strengthened by incorporating the result of static analysers as untrusted annotations and discharged by automated theorem provers. However, the results of object-oriented analyses are heavily...

متن کامل

fCube: An Efficient Prover for Intuitionistic Propositional Logic

We present fCube, a theorem prover for Intuitionistic propositional logic based on a tableau calculus. The main novelty of fCube is that it implements several optimization techniques that allow to prune the search space acting on different aspects of proof-search. We tested the efficiency of our techniques by comparing fCube with other theorem provers. We found that our prover outperforms the o...

متن کامل

Computing Answer Sets Using Model Generation Theorem Provers

Model generation theorem provers have the capability of producing a model when the first-order input theory is satisfiable. Because grounding step may generate huge propositional instances of the program it hardens the search process of answer set solvers. We propose the use of model generation theorem provers as computational engines for Answer Set Programming (ASP). It can be seen as lifting ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2000